The Smoothed Pólya–Vinogradov Inequality

نویسندگان

  • Kamil Adamczewski
  • Enrique Treviño
چکیده

Let χ be a primitive Dirichlet character to the modulus q. Let Sχ(M,N) = ∑ M 3, there is a primitive root g and an integer x ∈ [1, p − 1] such that g ≡ x mod p. It has also been used to improve the best known numerically explicit upper bound on the least inert prime in a real quadratic field. In this paper we will prove a smoothed Pólya–Vinogradov inequality which takes into account the arithmetic properties of the modulus and we extend the inequality to imprimitive characters. We also find a lower bound for the inequality.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Remarks on the Pólya–Vinogradov inequality

Abstract: We establish a numerically explicit version of the Pólya– Vinogradov inequality for the sum of values of a Dirichlet character on an interval. While the technique of proof is essentially that of Landau from 1918, the result we obtain has better constants than in other numerically explicit versions that have been found more recently.

متن کامل

Large Character Sums: Pretentious Characters and the Pólya-vinogradov Theorem

There has been no subsequent improvement in this inequality other than in the implicit constant. Moreover it is believed that (1.1) will be difficult to improve since it is possible (though highly unlikely) that there is an infinite sequence of primes q ≡ 3 (mod 4) for which (pq ) = 1 for all p < q , in which case M(( · q )) √ q log q. The unlikely possibility described above involves a quadrat...

متن کامل

The least inert prime in a real quadratic field

In this paper, we prove that for any positive fundamental discriminant D > 1596, there is always at least one prime p ≤ D0.45 such that the Kronecker symbol (D/p) = −1. This improves a result of Granville, Mollin and Williams, where they showed that the least inert prime p in a real quadratic field of discriminant D > 3705 is at most √ D/2. We use a “smoothed” version of the Pólya–Vinogradov in...

متن کامل

Branching Particle Systems and Compound Poisson Processes Related to Pólya-aeppli Distributions

We establish numerous new refined local limit theorems for a class of compound Poisson processes with Pólya-Aeppli marginals, and for a particular family of the branching particle systems which undergo critical binary branching and can be approximated by the backshifted Feller diffusion. To this end, we also derive new results for the families of Pólya–Aeppli and Poisson–exponential distributio...

متن کامل

Stability of Pólya-szegő Inequality for Log-concave Functions

A quantitative version of Pólya-Szegő inequality is proven for log-concave functions in the case of Steiner and Schwarz rearrangements.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012